Optimal Communication Complexity of Generic Multicast Key Distribution
نویسندگان
چکیده
منابع مشابه
Scalable Multicast Key Distribution
groups may also distribute working documents as Internet Drafts. Internet Drafts are draft documents valid for a maximum of six months. Internet Drafts may be updated, replaced, or obsoleted by other documents at any time. It is not appropriate to use Internet Drafts as reference material or to cite them other than as a \working draft" or \work in progress." Abstract Multicasting is becoming an...
متن کاملOptimal Multicast Group Communication
Many IP multicast based applications, such as PayTV, Multiplayer games, require controlling the group memberships of senders and receivers. One common solution is to encrypt the data with a session key shared with all authorized senders/receivers. To efficiently update the session key in the event of member removal, many rooted-tree based group key distribution schemes have been proposed. Howev...
متن کاملCommunication Complexity of Group Key
LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and spe...
متن کاملComputation Efficient Multicast Key Distribution (Extended Summary)
In many applications, multicast is an efficient means of distributing data in terms of resource (such as network bandwidth, server computation and I/O load) usage. The privacy of a multicast communication session is usually ensured using (symmetric) encryption. All the designated receivers or members in a multicast group share a session (encryption) key. In many applications, however, the multi...
متن کاملA Lower Bound for Multicast Key Distribution
With the rapidly growing importance of multicast in the Internet there have been recent proposal, such as RFC 2627, for scalable key distribution such that when the nth user joins or leaves a group, broadcasting Θ(log n) encrypted messages is sufficient to redistribute keys. In this paper, we show that this bound is also necessary for a general class of key distribution schemes and under differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2008
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2007.905593